Sciweavers

103 search results - page 14 / 21
» Practical Earley Parsing
Sort
View
ACL
1998
13 years 8 months ago
Some Properties of Preposition and Subordinate Conjunction Attachments
Determining the attachments of prepositions and subordinate conjunctions is a key problem in parsing natural language. This paper presents a trainable approach to making these att...
Alexander S. Yeh, Marc B. Vilain
ACL
1997
13 years 8 months ago
Representing Constraints with Automata
In this paper we describe an approach to constraint based syntactic theories in terms of finite tree automata. The solutions to constraints expressed in weak monadic second order ...
Frank Morawietz, Tom Cornell
COLING
2002
13 years 7 months ago
A Novel Disambiguation Method for Unification-Based Grammars Using Probabilistic Context-Free Approximations
We present a novel disambiguation method for unification-based grammars (UBGs). In contrast to other methods, our approach obviates the need for probability models on the UBG side...
Bernd Kiefer, Hans-Ulrich Krieger, Detlef Prescher
ENTCS
2002
91views more  ENTCS 2002»
13 years 7 months ago
Memoization-Based Proof Search in LF - an Experimental Evaluation of a Prototype
Elf is a general meta-language for the specification and implementation of logical systems in the style of the logical framework LF. Proof search in this framework is based on the...
Brigitte Pientka
CORR
1998
Springer
79views Education» more  CORR 1998»
13 years 7 months ago
Can Subcategorisation Probabilities Help a Statistical Parser?
Research into the automatic acquisition of lexical information from corpora is starting to produce large-scale computational lexicons containing data on the relative frequencies o...
John Carroll, Guido Minnen, Ted Briscoe