intTypePromotion=1
ADSENSE

The computational complexity

Xem 1-20 trên 519 kết quả The computational complexity
  • Dominance links were introduced in grammars to model long distance scrambling phenomena, motivating the definition of multiset-valued linear indexed grammars (MLIGs) by Rambow (1994b), and inspiring quite a few recent formalisms. It turns out that MLIGs have since been rediscovered and reused in a variety of contexts, and that the complexity of their emptiness problem has become the key to several open questions in computer science. We survey complexity results and open issues on MLIGs and related formalisms, and provide new complexity bounds for some linguistically motivated restrictions.

    pdf11p hongdo_1 12-04-2013 38 2   Download

  • Referring expressions and other object descriptions should be maximal under the Local Brevity, No Unnecessary Components, and Lexical Preference preference rules; otherwise, they may lead hearers to infer unwanted conversational implicatures. These preference rules can be incorporated into a polynomial time generation algorithm, while some alternative formalizations of conversational impficature make the generation task NP-Hard. and avoid utterance (lb). Incorrect conversational implicatures may also arise from inappropriate attributive (informational) descriptions. ...

    pdf8p bungio_1 03-05-2013 29 1   Download

  • In this paper we study a set of problems that are of considerable importance to Statistical Machine Translation (SMT) but which have not been addressed satisfactorily by the SMT research community. Over the last decade, a variety of SMT algorithms have been built and empirically tested whereas little is known about the computational complexity of some of the fundamental problems of SMT. Our work aims at providing useful insights into the the computational complexity of those problems.

    pdf8p bunthai_1 06-05-2013 37 1   Download

  • Morphological analysis must take into account the spelling-change processes of a language as well as its possible configurations of stems, affixes, and inflectional markings. The computational difficultyof the task can be clarified by investigating specific models of morphological processing. The use of finite-state machinery in the "twolevel" model by K i m m o Koskenniemi gives it the appearance of computational efficiency, but closer examination shows the model does not guarantee efficient processing.

    pdf7p bungio_1 03-05-2013 36 2   Download

  • .\lodern linguistic theory attributes surface complexity to interacting snbsystems of constraints. ["or instance, the I D LP gr,'unmar formalism separates constraints on immediate dominance from those on linear order. 5hieber's (t983) I D / I . P parsing algorithm shows how to use ID and LP constraints directly in language processing, without expandiqg them into an intcrmrdiate "object g a m m a r . " However, Shieber's purported O(:,Gi 2 .n ~) runtime bound underestimates the tlillicnlty of I D / L P parsing. I D / L P parsing is actually NP-complete, anti the worst-case runtime of...

    pdf6p bungio_1 03-05-2013 24 1   Download

  • An important goal of computational linguistics has been to use linguistic theory to guide the construction of computationally efficient real-world natural language processing systems. At first glance, generalized phrase structure grammar (GPSG) appears to be a blessing on two counts. First, the precise formalisms of GPSG might be a direct and fransparent guide for parser design and implementation. Second, since GPSG has weak context-free generative power and context-free languages can be parsed in O(n ~) by a wide range of algorithms, GPSG parsers would appear to run in polynomial time.

    pdf10p bungio_1 03-05-2013 27 1   Download

  • We analyse the computational complexity of phonological models as they have developed over the past twenty years. The major results ate that generation and recognition are undecidable for segmental models, and that recognition is NPhard for that portion of segmental phonology subsumed by modern autosegmental models. Formal restrictions are evaluated.

    pdf8p bungio_1 03-05-2013 32 1   Download

  • Nowadays it is difficult to imagine an area of knowledge that can continue developing without the use of computers and informatics. It is not different with biology, that has seen an unpredictable growth in recent decades, with the rise of a new discipline, bioinformatics, bringing together molecular biology, biotechnology and information technology.

    pdf456p lulanphuong 17-03-2012 131 17   Download

  • The purpose of The Computer Science Handbook is to provide a single comprehensive reference for com- puter scientists, software engineers, and IT professionals who wish to broaden or deepen their understand- ing in a particular subfield of computer science. Our goal is to provide the most current information in each of the following eleven subfields in a form that is accessible to students, faculty, and professionals in computer science

    pdf0p tiramisu0908 15-10-2012 56 8   Download

  • In the era globalisation the emerging technologies are governing engineering industries to a multifaceted state. The escalating complexity has demanded researchers to find the possible ways of easing the solution of the problems. This has motivated the researchers to grasp ideas from the nature and implant it in the engineering sciences.

    pdf0p bi_bi1 11-07-2012 46 5   Download

  • Harvester Studies in Cognitive Science is a new series which will explore the nature of knowledge by way of a distinctive theoretical approach one that takes account of the complex structures and interacting processes that make thought and action possible. Intelligence can be studied from the point of view of psychology, philosophy, linguistics, pedagogy and artificial intelligence, and all these different emphases will be represented within the series.

    pdf223p nhutretho 26-02-2013 32 5   Download

  • (BQ)Tài liệu Introduction to automata theory, languages and compution have used chapter 1 through 8 for a senior-level course, omiting only the material on inherent ambiguity in chapter 4 an portion of chapter 8. Chapter 7, 8, 12 and 13 form the nu cleus of couse on computation complexity. An advanced course on language theory could be buil around chapter 2 through 7, 9 through 11 and 14.

    pdf426p miragevn 06-10-2014 49 5   Download

  • A collaboratory is defined as a place where scientists and researchers work together to solve complex interdisciplinary problems, despite geographic and organizational boundaries [1]. The growth of the Internet and the advent of the computational ‘Grid’ [2, 3] have made it possible to develop and deploy advanced computational collaboratories [4, 5] that provide uniform (collaborative) access to computational resources, services, applications and/or data. These systems expand the resources available to researchers, enable ...

    pdf18p huggoo 20-08-2010 59 3   Download

  • This book got its start as an experiment in modern technology. When I started teaching at my present university (1998), the organization and architecture course focused on the 8088 running MS-DOS—essentially a programming environment as old as the sophomores taking the class. (This temporal freezing is unfortunately fairly common; when I took the same class during my undergraduate days, the computer whose architecture I studied was only two years younger than I was.

    pdf334p hotmoingay3 09-01-2013 37 5   Download

  • Tepper students partner with faculty, researchers, and students from other departments and schools, providing tech students with a well-rounded education. Dr. Coi eld believes this is one of the primary assets of the program. “Tepper students in the Com- puting and Information Technology track benei t from being in a university that values computing.

    pdf61p lenh_hoi_xung 22-02-2013 45 3   Download

  • Morphological lexica are often implemented on top of morphological paradigms, corresponding to different ways of building the full inflection table of a word. Computationally precise lexica may use hundreds of paradigms, and it can be hard for a lexicographer to choose among them. To automate this task, this paper introduces the notion of a smart paradigm. It is a metaparadigm, which inspects the base form and tries to infer which low-level paradigm applies. If the result is uncertain, more forms are given for discrimination.

    pdf9p bunthai_1 06-05-2013 37 3   Download

  • Results of computational complexity exist for a wide range of phrase structure-based grammar formalisms, while there is an apparent lack of such results for dependency-based formalisms. We here adapt a result on the complexity of ID/LP-grammars to the dependency framework. Contrary to previous studies on heavily restricted dependency grammars, we prove that recognition (and thus, parsing) of linguistically adequate dependency grammars is~A/T'-complete.

    pdf7p bunthai_1 06-05-2013 44 3   Download

  • this classic book on formal languages, automata theory, and computational complexity has been updated to present theoretical concepts in a concise and straightforward manner with the increase of hands-on, practical applications.

    pdf270p bautroibinhyen20 06-03-2017 20 3   Download

  • As the landscape of telecommunications service providers and service offerings evolves, the financial impact of change should be considered. Changes in service provider invoices that reflect administrative and financial impact created by service changes contributes to the overall complexity of financial management. Each time a service provider rolls out a new service offering, repackages existing technology or improves their service in any way, the financial management points to monitor and report upon also change.

    pdf4p thuyvan 12-08-2009 88 2   Download

  • Tuyển tập các báo cáo nghiên cứu khoa học hay nhất của tạp chí toán học quốc tế đề tài: A Note on the Asymptotics and Computational Complexity of Graph Distinguishability...

    pdf7p thulanh4 11-09-2011 33 2   Download

CHỦ ĐỀ BẠN MUỐN TÌM

ADSENSE

p_strKeyword=The computational complexity
p_strCode=thecomputationalcomplexity

nocache searchPhinxDoc

 

Đồng bộ tài khoản