Sciweavers

2750 search results - page 124 / 550
» Learning Efficient Parsing
Sort
View
97
Voted
ACL
2006
15 years 3 months ago
From Prosodic Trees to Syntactic Trees
This paper describes an ongoing effort to parse the Hebrew Bible. The parser consults the bracketing information extracted from the cantillation marks of the Masoetic text. We fir...
Andi Wu, Kirk Lowery
ACL
1998
15 years 3 months ago
Time Mapping with Hypergraphs
Word graphs are able to represent a large number of different utterance hypotheses in a very compact manner. However, usually they contain a huge amount of redundancy in terms of ...
Jan W. Amtrup, Volker Weber
ACL
1997
15 years 3 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
ASE
2002
137views more  ASE 2002»
15 years 2 months ago
The DSD Schema Language
XML (Extensible Markup Language), a linear syntax for trees, has gathered a remarkable amount of interest in industry. The acceptance of XML opens new venues for the application o...
Nils Klarlund, Anders Møller, Michael I. Sc...
ENTCS
2002
91views more  ENTCS 2002»
15 years 2 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