Sciweavers

122 search results - page 13 / 25
» grammars 2000
Sort
View
COLING
2000
13 years 11 months ago
Context-Free Grammar Rewriting and the Transfer of Packed Linguistic Representations
We propose an algorithm for the trausfer of packed linguistic structures, that is, finite collections of labelled graphs which share certain subparts. A labelled graph is seen as ...
Marc Dymetman, Frédéric Tendeau
COLING
2000
13 years 11 months ago
Compiling Language Models from a Linguistically Motivated Unification Grammar
Systems now exist which are able to con:pile unification gralmnars into language models that can be included in a speech recognizer, but it is so far unclear whether non-trivial l...
Manny Rayner, Beth Ann Hockey, Frankie James, Eliz...
NAACL
2007
13 years 11 months ago
Lexicalized Markov Grammars for Sentence Compression
We present a sentence compression system based on synchronous context-free grammars (SCFG), following the successful noisy-channel approach of (Knight and Marcu, 2000). We define...
Michel Galley, Kathleen McKeown
ANLP
2000
96views more  ANLP 2000»
13 years 11 months ago
Efficient parsing strategies for syntactic analysis of closed captions
We present an efficientmulti-levelchart parser that was designed forsyntacticanalysisofclosedcaptions (subtitles) in a real-time Machine Translation (MT) system. In order to achie...
Krzysztof Czuba
LREC
2008
100views Education» more  LREC 2008»
13 years 11 months ago
Rule-Based Chunker for Croatian
In this paper we discuss a rule-based approach to chunking sentences in Croatian, implemented using local regular grammars within the NooJ development environment. We describe the...
Kristina Vuckovic, Marko Tadic, Zdravko Dovedan