- 1、本文档共7页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Abstract Statistics of Morphological Finite-State Transition Networks Obey the
Statistics of Morphological Finite-State Transition Networks
Obey the Power Law
Alexander Troussov, Brian O’Donovan
IBM Dublin Software Lab, Airways Ind. Est., Cloghran, Dublin 17, Ireland
{atrousso, Brian_ODonovan}@
Abstract
Finite-state devices are widely used in natural lan-
guage processing, yet little if anything is known about
metrics and topology of finite-state transition graphs.
Here we study numerically the structure of directed
state transition graphs for several types of finite-state
devices representing morphology of 16 languages. In
all experiments we have found that distribution of in-
coming and outcoming links is highly skewed and is
modeled well by the power law, not by Poisson distri-
bution typical of classical random graphs. The power-
law form of degree distribution is regarded as a signa-
ture of self-organizing systems, and it has been previ-
ously found for numerous real world networks in
communication, biology, social sciences and econom-
ics.
1 Introduction
Finite-state devices, including finite-state automata
and transducers, are widely used in natural language
processing to produce morphological information.
Constructed as applications of formal finite-state
techniques, they can be considered as networks where
nodes represent states and arcs (labeled by characters)
represent the transitions. Examination of their graph-
metrics and topology is essential for efficient com-
puter implementation of finite-state processing, in-
cluding per-node optimization. It might also lead to
new quantitative methods in language typology as we
argue below.
In computational linguistics semantic and co-
occurrence networks were already studied. In these
networks nodes correspond to words. In semantic
networks the links show semantic relations between
words. In co-occurrence networks links represent the
fact that words occur beside each other in a corpus.
We are not aware of similar investigations applied to
finite-state t
文档评论(0)