#30091Sequences of cascades of rules deterministically analyze thetext, building unambiguous structures.
tech,18-5-E99-1014,ak
multilingual text classification
</term>
and
<term>
IE
</term>
. In order to build robust
<term>
automatic
#30153It was implemented in the IE module of FACILE, a EU project for multilingual text classification andIE.
other,11-4-E99-1014,ak
<term>
languages
</term>
and different
<term>
domains
</term>
. It was implemented in the IE module
#30133The approach was proven to work for three languages and differentdomains.
other,13-1-E99-1014,ak
<term>
Information Extraction
</term>
from
<term>
texts
</term>
. Sequences of
<term>
cascades of rules
#30081This paper proposes an approach to full parsing suitable for Information Extraction fromtexts.
other,8-4-E99-1014,ak
approach was proven to work for three
<term>
languages
</term>
and different
<term>
domains
</term>
#30130The approach was proven to work for threelanguages and different domains.
tech,14-5-E99-1014,ak
module of FACILE , a EU project for
<term>
multilingual text classification
</term>
and
<term>
IE
</term>
. In order to build
#30149It was implemented in the IE module of FACILE, a EU project formultilingual text classification and IE.
other,2-3-E99-1014,ak
unambiguous structures . Initially basic
<term>
chunks
</term>
are analyzed ; then
<term>
argumental
#30099Initially basicchunks are analyzed; then argumental relations are recognized; finally modifier attachment is performed and the global parse tree is built.
tech,2-2-E99-1014,ak
from
<term>
texts
</term>
. Sequences of
<term>
cascades of rules
</term>
deterministically analyze the
<term>
#30085Sequences ofcascades of rules deterministically analyze the text, building unambiguous structures.
tech,10-1-E99-1014,ak
<term>
full parsing
</term>
suitable for
<term>
Information Extraction
</term>
from
<term>
texts
</term>
. Sequences
#30078This paper proposes an approach to full parsing suitable forInformation Extraction from texts.
other,19-3-E99-1014,ak
attachment
</term>
is performed and the
<term>
global parse tree
</term>
is built . The approach was proven
#30116Initially basic chunks are analyzed; then argumental relations are recognized; finally modifier attachment is performed and theglobal parse tree is built.
other,13-3-E99-1014,ak
relations
</term>
are recognized ; finally
<term>
modifier attachment
</term>
is performed and the
<term>
global
#30110Initially basic chunks are analyzed; then argumental relations are recognized; finallymodifier attachment is performed and the global parse tree is built.
tech,6-1-E99-1014,ak
This paper proposes an approach to
<term>
full parsing
</term>
suitable for
<term>
Information Extraction
#30074This paper proposes an approach tofull parsing suitable for Information Extraction from texts.