Computer Science – Computation and Language
Scientific paper
2002-09-02
COLING 2002, Proceedings of the main Conference; The Association for Computational Linguistics and Chinese Language Processing
Computer Science
Computation and Language
7 pages, 1 figure, LaTeX 2e using COLACL and EPSF packages. Proceedings of the 19th International Conference on Computational
Scientific paper
In some contexts, well-formed natural language cannot be expected as input to information or communication systems. In these contexts, the use of grammar-independent input (sequences of uninflected semantic units like e.g. language-independent icons) can be an answer to the users' needs. A semantic analysis can be performed, based on lexical semantic knowledge: it is equivalent to a dependency analysis with no syntactic or morphological clues. However, this requires that an intelligent system should be able to interpret this input with reasonable accuracy and in reasonable time. Here we propose a method allowing a purely semantic-based analysis of sequences of semantic units. It uses an algorithm inspired by the idea of ``chart parsing'' known in Natural Language Processing, which stores intermediate parsing results in order to bring the calculation time down. In comparison with using declarative logic programming - where the calculation time, left to a prolog engine, is hyperexponential -, this method brings the calculation time down to a polynomial time, where the order depends on the valency of the predicates.
No associations
LandOfFree
A Chart-Parsing Algorithm for Efficient Semantic Analysis does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Chart-Parsing Algorithm for Efficient Semantic Analysis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Chart-Parsing Algorithm for Efficient Semantic Analysis will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-280742