ABSTRACT
Over the past five years, we have developed a natural language processing (NLP) system called LINK. LINK is a unification-based system, in which all syntactic and semantic analysis is performed in a single step. Syntactic and semantic information are both represented in the grammar in a uniform manner, similar to HPSG (Pollard and Sag, 1987).
- Ford, M., Bresnan, J., and Kaplan. R. (1982). A competence-based theory of syntactic closure. In Bresnan, J. (ed), The Mental Representation of Grammatical Relations. Cambridge, MA: MIT Press.Google Scholar
- Huyck, C., and Lytinen, S. (1993). Efficient heuristic natural language parsing. In Proceedings of the Eleventh National Conference on Artificial Intelligence, Washington, D.C., July 1993.Google ScholarDigital Library
- Shieber, S. (1986). An Introduction to Unification-Based Approaches to Grammar. Stanford, CA: Center for the Study of Language and Information.Google Scholar
- Pollard, C., and Sag, I. (1987). Information-based Syntax and Semantics. Stanford, CA: Center for the Study of Language and Information. Google ScholarDigital Library
Recommendations
Description of the LINK system used for MUC-4
MUC4 '92: Proceedings of the 4th conference on Message understandingThe University of Michigan's natural language processing system, called LINK, is a unification-based system which we have developed over the last four years. Prior to MUC-4, LINK had been used to extract information from free-form texts in two narrow ...
On different LL and LR parsers used in LLLR parsing
The LLLR parser can be constructed for any LR grammar.The LLLR parser produces the left parse of the input string without backtracking.The canonical LL or the LALL parser can be used as the backbone parser.Small canonical or LALR parsers are used for LL ...
Applying Link Grammar Formalism in the Development of English-Indonesian Machine Translation System
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer MathematicsIn this paper, we present a Machine Translation (MT) system from English to Indonesian by applying Link Grammar (LG) formalism. The Annotated Disjunct (ADJ) technique available in the LG formalism is utilized to map English sentences into equivalent ...
Comments