English
Related papers

Related papers: Extraction in Dutch with Lexical Rules

200 papers

We propose a new grammar-based language for defining information-extractors from documents (text) that is built upon the well-studied framework of document spanners for extracting structured data from text. While previously studied…

Databases · Computer Science 2023-01-25 Liat Peterfreund

In this paper we present a general method for information extraction that exploits the features of data compression techniques. We first define and focus our attention on the so-called "dictionary" of a sequence. Dictionaries are…

Statistical Mechanics · Physics 2009-11-10 A. Baronchelli , E. Caglioti , V. Loreto , E. Pizzi

This paper investigates the syntax of extraposition in the HPSG framework. We present English and German data (partly taken from corpora), and provide an analysis using lexical rules and a nonlocal dependency. The condition for binding this…

cmp-lg · Computer Science 2016-08-31 Frank Keller

This paper explores the kinds of probabilistic relations that are important in syntactic disambiguation. It proposes that two widely used kinds of relations, lexical dependencies and structural relations, have complementary disambiguation…

Computation and Language · Computer Science 2007-05-23 Khalil Sima'an

We describe an approach to robust domain-independent syntactic parsing of unrestricted naturally-occurring (English) input. The technique involves parsing sequences of part-of-speech and punctuation labels using a unification-based grammar…

cmp-lg · Computer Science 2008-02-03 Ted Briscoe , John Carroll

This paper presents a constraint-based morphological disambiguation approach that is applicable languages with complex morphology--specifically agglutinative languages with productive inflectional and derivational morphological phenomena.…

cmp-lg · Computer Science 2008-02-03 Kemal Oflazer , Gokhan Tur

In a lexicalized grammar formalism such as Lexicalized Tree-Adjoining Grammar (LTAG), each lexical item is associated with at least one elementary structure (supertag) that localizes syntactic and semantic dependencies. Thus a parser for a…

cmp-lg · Computer Science 2008-02-03 Aravind K. Joshi , B. Srinivas

A way of extracting French verbal chunks, inflected and infinitive, is explored and tested on effective corpus. Declarative morphological and local grammar rules specifying chunks and some simple contextual structures are used, relying on…

Computation and Language · Computer Science 2007-05-23 Gabriel G. Bes , Lionel Lamadon , Francois Trouilleux

Literal movement grammars (LMGs) provide a general account of extraposition phenomena through an attribute mechanism allowing top-down displacement of syntactical information. LMGs provide a simple and efficient treatment of complex…

cmp-lg · Computer Science 2016-08-31 Annius V. Groenink

Ontologies formalise how the concepts from a given domain are interrelated. Despite their clear potential as a backbone for explainable AI, existing ontologies tend to be highly incomplete, which acts as a significant barrier to their more…

Artificial Intelligence · Computer Science 2021-05-12 Steven Schockaert , Yazmín Ibáñez-García , Víctor Gutiérrez-Basulto

We present a methodology to extract Selectional Restrictions at a variable level of abstraction from phrasally analyzed corpora. The method relays in the use of a wide-coverage noun taxonomy and a statistical measure of the co-occurrence of…

cmp-lg · Computer Science 2008-02-03 Francesc Ribas

Fully data-driven, deep learning-based models are usually designed as language-independent and have been shown to be successful for many natural language processing tasks. However, when the studied language is low-resourced and the amount…

Computation and Language · Computer Science 2022-09-21 Şaziye Betül Özateş , Arzucan Özgür , Tunga Güngör , Balkız Öztürk

In our previous work, we proposed the logic obtained from full non-associative Lambek calculus by adding a sort of linear-logical modality. We call this logic non-associative non-commutative intuitionistic linear logic ($\mathbf{NACILL}$,…

Logic · Mathematics 2020-03-04 Hiromi Tanaka

Sentences with gapping, such as Paul likes coffee and Mary tea, lack an overt predicate to indicate the relation between two or more arguments. Surface syntax representations of such sentences are often produced poorly by parsers, and even…

Computation and Language · Computer Science 2018-04-20 Sebastian Schuster , Joakim Nivre , Christopher D. Manning

Neural relation extraction discovers semantic relations between entities from unstructured text using deep learning methods. In this study, we present a comprehensive review of methods on neural network based relation extraction. We discuss…

Computation and Language · Computer Science 2020-07-09 Mehmet Aydar , Ozge Bozal , Furkan Ozbay

The project presented in this article aims to formalize criteria and procedures in order to extract semantic information from parsed dictionary glosses. The actual purpose of the project is the generation of a semantic network (nearly an…

Computation and Language · Computer Science 2013-05-20 Daniel Christen

Most recent research in trainable part of speech taggers has explored stochastic tagging. While these taggers obtain high accuracy, linguistic information is captured indirectly, typically in tens of thousands of lexical and contextual…

cmp-lg · Computer Science 2008-02-03 Eric Brill

This paper explores morpho-syntactic ambiguities for French to develop a strategy for part-of-speech disambiguation that a) reflects the complexity of French as an inflected language, b) optimizes the estimation of probabilities, c) allows…

cmp-lg · Computer Science 2007-05-23 Evelyne Tzoukermann , Dragomir R. Radev , William A. Gale

This document describes a sizable grammar of English written in the TAG formalism and implemented for use with the XTAG system. This report and the grammar described herein supersedes the TAG grammar described in an earlier 1995 XTAG…

Computation and Language · Computer Science 2012-08-27 XTAG Research Group

We describe a case study in the application of {\em symbolic machine learning} techniques for the discovery of linguistic rules and categories. A supervised rule induction algorithm is used to learn to predict the correct diminutive suffix…

cmp-lg · Computer Science 2008-02-03 Walter Daelemans , Peter Berck , Steven Gillis