Computer Science – Computation and Language
Scientific paper
1995-02-14
Computer Science
Computation and Language
paper (81 pages), appendix (17 pages, Prolog code), format: .ps compressed and uuencoded
Scientific paper
This paper defines unification based ID/LP grammars based on typed feature structures as nonterminals and proposes a variant of Earley's algorithm to decide whether a given input sentence is a member of the language generated by a particular typed unification ID/LP grammar. A solution to the problem of the nonlocal flow of information in unification ID/LP grammars as discussed in Seiffert (1991) is incorporated into the algorithm. At the same time, it tries to connect this technical work with linguistics by presenting an example of the problem resulting from HPSG approaches to linguistics (Hinrichs and Nakasawa 1994, Richter and Sailer 1995) and with computational linguistics by drawing connections from this approach to systems implementing HPSG, especially the TROLL system, Gerdemann et al. (forthcoming).
No associations
LandOfFree
Formalization and Parsing of Typed Unification-Based ID/LP Grammars 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 Formalization and Parsing of Typed Unification-Based ID/LP Grammars, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Formalization and Parsing of Typed Unification-Based ID/LP Grammars will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-106168