http://www.bibsonomy.org/burst/user/fsteegBibSonomy BuRST Feed for /user/fsteeg2008-07-21T00:56:28+02:00http://www.bibsonomy.org/bibtex/2d4fd323f33056430c73ada0203eb38ec/fsteegfsteeg2008-07-19T01:53:26+02:00java <span style="color:#555555;">Joshua <a href="http://www.bibsonomy.org/author/Bloch">Bloch</a> </span><em>Addison-Wesley, </em><em>Second edition, </em>(<em>2008</em>)Sat Jul 19 01:53:26 CEST 2008SecondPaperbackEffective Java2008java [0806.3787] Computational Approaches to Measuring the Similarity of Short Contexts: A Review of Applications and Methodshttp://www.bibsonomy.org/bibtex/2d0bb23c0c2a51c352a5e445f94846ff7/fsteegfsteeg2008-06-25T14:11:28+02:00semantics wsd <span style="color:#555555;">Ted <a href="http://www.bibsonomy.org/author/Pedersen">Pedersen</a> </span><em>Jun2008. </em>Wed Jun 25 14:11:28 CEST 2008Jun Computational Approaches to Measuring the Similarity of Short Contexts: A Review of Applications and Methods 2008 semantics wsd Measuring the similarity of short written contexts is a fundamental problem in Natural Language Processing. This article provides a unifying framework by which short context problems can be categorized both by their intended application and proposed solution. The goal is to show that various problems and methodologies that appear quite different on the surface are in fact very closely related. The axes by which these categorizations are made include the format of the contexts (headed versus headless), the way in which the contexts are to be measured (first-order versus second-order similarity), and the information used to represent the features in the contexts (micro versus macro views). The unifying thread that binds together many short context applications and methods is the fact that similarity decisions must be made between contexts that share few (if any) words in common. http://www.bibsonomy.org/bibtex/251cdb32e9cd58d966faa101c7183e5c9/fsteegfsteeg2008-06-25T01:35:18+02:00semantics wsd <span style="color:#555555;">Ludwig <a href="http://www.bibsonomy.org/author/Wittgenstein">Wittgenstein</a> </span><em>Bibliothek Suhrkamp </em><em>Suhrkamp, </em><em>Frankfurt a. M., </em><em>September1953. </em>Wed Jun 25 01:35:18 CEST 2008Frankfurt a. M.SeptemberBibliothek SuhrkampPhilosophische Untersuchungen - Auf Grundlage der Kritisch-genetischen Edition, neu herausgegeben von Joachim Schulte, 200313721953semantics wsd How Is Meaning Grounded in Dictionary Definitions?http://www.bibsonomy.org/bibtex/239f61f164449a4ac4a9850b83695895b/fsteegfsteeg2008-06-24T10:44:11+02:00wsd semantics <span style="color:#555555;">A. <a href="http://www.bibsonomy.org/author/Blondin Masse">Blondin Masse</a> and G. <a href="http://www.bibsonomy.org/author/Chicoisne">Chicoisne</a> and Y. <a href="http://www.bibsonomy.org/author/Gargouri">Gargouri</a> and S. <a href="http://www.bibsonomy.org/author/Harnad">Harnad</a> and O. <a href="http://www.bibsonomy.org/author/Picard">Picard</a> and O. <a href="http://www.bibsonomy.org/author/Marcotte">Marcotte</a> </span><em>CoRR/0806.3710</em><em>Jun2008. </em>Tue Jun 24 10:44:11 CEST 2008CoRR/0806.3710Jun How Is Meaning Grounded in Dictionary Definitions? 2008 wsd semantics Meaning cannot be based on dictionary definitions all the way down: at some point the circularity of definitions must be broken in some way, by grounding the meanings of certain words in sensorimotor categories learned from experience or shaped by evolution. This is the "symbol grounding problem." We introduce the concept of a reachable set -- a larger vocabulary whose meanings can be learned from a smaller vocabulary through definition alone, as long as the meanings of the smaller vocabulary are themselves already grounded. We provide simple algorithms to compute reachable sets for any given dictionary. http://www.bibsonomy.org/bibtex/27b223e3b7ad875a5bae25373e6583ef5/fsteegfsteeg2008-05-21T23:07:18+02:00prolog fg <span style="color:#555555;">John H. <a href="http://www.bibsonomy.org/author/Connolly">Connolly</a> </span><em>International Journal of Man-Machine Studies</em><em>24(6):623-632</em>(<em>1986</em>)Wed May 21 23:07:18 CEST 2008International Journal of Man-Machine Studies6623-632Testing Functional Grammar placement rules using PROLOG241986prolog fg What can we do about the unnecessary diversity of notation for syntactic definitions?http://www.bibsonomy.org/bibtex/2f6b9ac839af5ba5c67f8ef8c380310ec/fsteegfsteeg2008-05-12T00:59:44+02:00ebnf <span style="color:#555555;">Niklaus <a href="http://www.bibsonomy.org/author/Wirth">Wirth</a> </span><em>Commun. ACM</em><em>20(11):822--823</em>(<em>1977</em>)Mon May 12 00:59:44 CEST 2008New York, NY, USACommun. ACM11822--823What can we do about the unnecessary diversity of notation for syntactic definitions?201977ebnf The population of programming languages is steadily growing, and there is no end of this growth in sight. Many language definitions appear in journals, many are found in technical reports, and perhaps an even greater number remains confined to proprietory circles. After frequent exposure to these definitions, one cannot fail to notice the lack of “common denominators.” The only widely accepted fact is that the language structure is defined by a syntax. But even notation for syntactic description eludes any commonly agreed standard form, although the underlying ancestor is invariably the Backus-Naur Form of the Algol 60 report. As variations are often only slight, they become annoying for their very lack of an apparent motivation.http://www.bibsonomy.org/bibtex/24756a3adba692c588c63a994807a9ca2/fsteegfsteeg2008-05-12T00:43:28+02:00three-tier <span style="color:#555555;">Wayne W. <a href="http://www.bibsonomy.org/author/Eckerson">Eckerson</a> </span><em>Open Information Systems</em>(<em>1995</em>)Mon May 12 00:43:28 CEST 2008Open Information Systems1Three Tier Client/Server Architecture: Achieving Scalability, Performance, and Efficiency in Client Server Applications.101995three-tier http://www.bibsonomy.org/bibtex/254e11aa13a24af24ca1b2647be6fbdc2/fsteegfsteeg2008-05-11T22:52:06+02:00dsl programming metaprogramming <span style="color:#555555;">Martin <a href="http://www.bibsonomy.org/author/Ward">Ward</a> </span><em>Science Labs Durham, </em>(<em>2003</em>)Sun May 11 22:52:06 CEST 2008Science Labs DurhamLanguage Oriented Programming2003dsl programming metaprogramming http://www.bibsonomy.org/bibtex/284d1fc25da720fc5521d0fb2b2fe84c7/fsteegfsteeg2008-05-07T18:07:23+02:00svc linguistics fdg <span style="color:#555555;">Miriam van <a href="http://www.bibsonomy.org/author/Staden">Staden</a> </span><em>Poster presented at the Eleventh Biennial Symposium: Intertheoretical Approaches to Complex Verb Constructions. Houston: Rice University., </em>(<em>2006</em>)Wed May 07 18:07:23 CEST 2008Poster presented at the Eleventh Biennial Symposium: Intertheoretical Approaches to Complex Verb Constructions. Houston: Rice University.Papuan narratives in Functional Discourse Grammar2006svc linguistics fdg http://www.bibsonomy.org/bibtex/26773247a94d341d9f2707064ca909798/fsteegfsteeg2008-04-13T22:59:41+02:00programming intelligent-systems <span style="color:#555555;">Frederick P. <a href="http://www.bibsonomy.org/author/Brooks">Brooks</a> </span><em>Addison-Wesley Professional, </em><em>August1995. </em>Sun Apr 13 22:59:41 CEST 2008PaperbackAugustThe Mythical Man-Month: Essays on Software Engineering, 20th Anniversary Edition1995programming intelligent-systems <I>The</I> classic book on the human elements of software engineering. Software tools and development environments may have changed in the 21 years since the first edition of this book, but the peculiarly nonlinear economies of scale in collaborative work and the nature of individuals and groups has not changed an epsilon. If you write code or depend upon those who do, get this book as soon as possible -- from Amazon.com Books, your library, or anyone else. You (and/or your colleagues) will be forever grateful. Very Highest Recommendation.http://www.bibsonomy.org/bibtex/26ac07561b543e6033fd4c9811d0dccad/fsteegfsteeg2008-04-13T22:56:44+02:00diss ir text-mining nlp <span style="color:#555555;">Sholom M. <a href="http://www.bibsonomy.org/author/Weiss">Weiss</a> and Nitin <a href="http://www.bibsonomy.org/author/Indurkhya">Indurkhya</a> and T. <a href="http://www.bibsonomy.org/author/Zhang">Zhang</a> </span><em>Springer, Berlin, </em>(<em>2004</em>)Sun Apr 13 22:56:44 CEST 2008Text Mining. Predictive Methods for Analyzing Unstructured Information2004diss ir text-mining nlp http://www.bibsonomy.org/bibtex/214c181d39333cf6bd44f4a5f5461cb7a/fsteegfsteeg2008-04-13T22:55:44+02:00diss <span style="color:#555555;">Stuart Jonathan <a href="http://www.bibsonomy.org/author/Russell">Russell</a> and Peter <a href="http://www.bibsonomy.org/author/Norvig">Norvig</a> </span><em>Prentice Hall series in artificial intelligence </em><em>Prentice Hall, </em><em>Upper Saddle River, </em><em>2nd edition, </em>(<em>2003</em>)Sun Apr 13 22:55:44 CEST 2008Upper Saddle River2ndPrentice Hall series in artificial intelligenceArtificial Intelligence: A Modern Approach2003diss Includes bibliographical references (p. 987 - 1043) and indexhttp://www.bibsonomy.org/bibtex/22209eaf729c60d9b61ac4ded80fb674d/fsteegfsteeg2008-04-13T22:54:57+02:00evaluation diss <span style="color:#555555;">Kishore <a href="http://www.bibsonomy.org/author/Papineni">Papineni</a> and Salim <a href="http://www.bibsonomy.org/author/Roukos">Roukos</a> and Todd <a href="http://www.bibsonomy.org/author/Ward">Ward</a> and Wei-Jing <a href="http://www.bibsonomy.org/author/Zhu">Zhu</a> </span><em>Computational Linguistics (ACL), Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics (ACL), Philadelphia, </em><em>page311-318. </em>(<em>2002</em>)Sun Apr 13 22:54:57 CEST 2008Computational Linguistics (ACL), Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics (ACL), Philadelphia311-318Bleu: a Method for Automatic Evaluation of Machine Translation2002evaluation diss http://www.bibsonomy.org/bibtex/2635e5681079967231d660020ae751436/fsteegfsteeg2008-04-13T19:54:24+02:00ir text-mining nlp diss <span style="color:#555555;">Jin <a href="http://www.bibsonomy.org/author/Zhang">Zhang</a> </span><em>Springer, Berlin, </em>(<em>2007</em>)Sun Apr 13 19:54:24 CEST 2008Visualization for Information Retrieval2007ir text-mining nlp diss http://www.bibsonomy.org/bibtex/2882f7a744300fad673998941b89d4504/fsteegfsteeg2008-04-12T20:13:56+02:00linguistics corpus-linguistics <span style="color:#555555;">William <a href="http://www.bibsonomy.org/author/Labov">Labov</a> </span><em>Papers from the Parasession on Theory and Data in Linguistics, </em><em>Chicago, </em><em>University of Chicago, </em>(<em>1996</em>)Sat Apr 12 20:13:56 CEST 2008ChicagoPapers from the Parasession on Theory and Data in LinguisticsCLS 32When Intuitions Fail1996linguistics corpus-linguistics http://www.bibsonomy.org/bibtex/2ab78c18261b44eb9b301b8e4bf73d16d/fsteegfsteeg2008-04-12T20:11:21+02:00nlp ir diss text-mining <span style="color:#555555;">Anne <a href="http://www.bibsonomy.org/author/Kao">Kao</a> and Steve R. <a href="http://www.bibsonomy.org/author/Poteet">Poteet</a> </span><em>Springer, Berlin, </em>(<em>2006</em>)Sat Apr 12 20:11:21 CEST 2008Natural Language Processing and Text Mining2006nlp ir diss text-mining Text Mining: Wissensrohstoff Text. Konzepte, Algorithmen, Ergebnissehttp://www.bibsonomy.org/bibtex/241697bc55b98ef8bf83900c92d2b634e/fsteegfsteeg2008-04-12T20:09:19+02:00diss nlp <span style="color:#555555;">Gerhard <a href="http://www.bibsonomy.org/author/Heyer">Heyer</a> and Uwe <a href="http://www.bibsonomy.org/author/Quasthoff">Quasthoff</a> and Thomas <a href="http://www.bibsonomy.org/author/Wittig">Wittig</a> </span><em>W3l, </em>(<em>2006</em>)Sat Apr 12 20:09:19 CEST 2008Text Mining: Wissensrohstoff Text. Konzepte, Algorithmen, Ergebnisse2006diss nlp http://www.bibsonomy.org/bibtex/2c95740c8571970f424340a9638e0bfdc/fsteegfsteeg2008-04-12T15:13:46+02:00agents text-mining diss nlp <span style="color:#555555;">Lean <a href="http://www.bibsonomy.org/author/Yu">Yu</a> and Shouyang <a href="http://www.bibsonomy.org/author/Wang">Wang</a> and Lai Kin <a href="http://www.bibsonomy.org/author/Keung">Keung</a> </span><em>Emerging Technologies of Text Mining: Techniques and Applications, </em><em>page162--183. </em><em>Information Science Reference, </em>(<em>2008</em>)Sat Apr 12 15:13:46 CEST 2008Emerging Technologies of Text Mining: Techniques and Applications162--183A Multi-Agent Neural Network System for Web Text Mining2008agents text-mining diss nlp http://www.bibsonomy.org/bibtex/28108f1a43c2a61ff07e204c3d25e59b1/fsteegfsteeg2008-04-12T03:54:22+02:00diss agents ai mas <span style="color:#555555;">Hong <a href="http://www.bibsonomy.org/author/Lin">Lin</a> </span><em>Information Science Reference, </em>(<em>2007</em>)Sat Apr 12 03:54:22 CEST 2008Architectural Design of Multi-Agent Systems: Technologies and Techniques2007diss agents ai mas http://www.bibsonomy.org/bibtex/2ab38ed7b78f0aa5b051f4c905b1229a1/fsteegfsteeg2008-04-12T03:49:59+02:00diss mas agents ai <span style="color:#555555;">Thomas A. <a href="http://www.bibsonomy.org/author/Wagner">Wagner</a> (eds.). </span><em>Multiagent Systems, Artificial Societies, and Simulated Organizations </em><em>Springer, </em>(<em>2004</em>)Sat Apr 12 03:49:59 CEST 2008Multiagent Systems, Artificial Societies, and Simulated OrganizationsAn Application Science for Multi-Agent Systems2004diss mas agents ai