Sciweavers

6 search results - page 1 / 2
» LFG Generation Produces Context-free Languages
Sort
View
LREC
2010
203views Education» more  LREC 2010»
13 years 6 months ago
Arabic Parsing Using Grammar Transforms
We investigate Arabic Context Free Grammar parsing with dependency annotation comparing lexicalised and unlexicalised parsers. We study how morphosyntactic as well as function tag...
Lamia Tounsi, Josef van Genabith
MFCS
1998
Springer
13 years 9 months ago
Facial Circuits of Planar Graphs and Context-Free Languages
It is known that a language is context-free iff it is the set of borders of the trees of recognizable set, where the border of a (labelled) tree is the word consisting of its leaf ...
Bruno Courcelle, Denis Lapoire
RSCTC
2000
Springer
126views Fuzzy Logic» more  RSCTC 2000»
13 years 8 months ago
Evolutionary Parsing for a Probabilistic Context Free Grammar
Abstract. Classic parsing methods are based on complete search techniques to find the different interpretations of a sentence. However, the size of the search space increases expon...
Lourdes Araujo
ACL
1998
13 years 6 months ago
Ambiguity Preserving Machine Translation using Packed Representations
In this paper we present an ambiguity preserving translation approach which transfers ambiguous LFG f-structure representations. It is based on packed f-structure representations ...
Martin C. Emele, Michael Dorna