This paper explores the prevalent
syntactic aggregation constructs in Bengali and present an approach towards generating fluent Bengali compound sentences using
the identified constructs.
PARSING ARABIC VERB PHRASES USING PREGROUP GRAMMARSijnlc
Parsing of Arabic phrases is a crucial requirement for many applications such as question answering and machine translation. The calculus of pregroup introduced by Lambek as an algebraic computational machinery for the grammatical analysis of natural languages. Pregroup grammar used to analyse sentence structure in many European languages such as English, and non-European languages such as Japanese. In Arabic language, Lambek employed the notions of pregroup to analyse some grammatical structures such as conjugating the verb, tense modifiers and equational sentences. This work attempts to develop an initial phase of an efficient automatic pregroup grammar parser by using linear approach to analysethe verbal phrases of Modern Standard Arabic (MSA). The proposed system starts building Arabic lexicon contains all possible categories of Arabic verbs, then analysing the input verbal Arabic phrase to check if it is wellformed by using linear parsing algorithm based on pregroup grammar rules.
RuleML2015 The Herbrand Manifesto - Thinking Inside the Box RuleML
The traditional semantics for First Order Logic (sometimes called Tarskian semantics) is based on the notion of interpretations of constants. Herbrand semantics is an alternative semantics based directly on truth assignments for ground sentences rather than interpretations of constants. Herbrand semantics is simpler and more intuitive than Tarskian semantics; and, consequently, it is easier to teach and learn. Moreover, it is more expressive. For example, while it is not possible to finitely axiomatize integer arithmetic with Tarskian semantics, this can be done easily with Herbrand Semantics. The downside is a loss of some common logical properties, such as compactness and completeness. However, there is no loss of inferential power. Anything that can be proved according to Tarskian semantics can also be proved according to Herbrand semantics. In this presentation, we define Herbrand semantics; we look at the implications for research on logic and rules systems and automated reasoning; and and we assess the potential for popularizing logic.
This paper explores the prevalent
syntactic aggregation constructs in Bengali and present an approach towards generating fluent Bengali compound sentences using
the identified constructs.
PARSING ARABIC VERB PHRASES USING PREGROUP GRAMMARSijnlc
Parsing of Arabic phrases is a crucial requirement for many applications such as question answering and machine translation. The calculus of pregroup introduced by Lambek as an algebraic computational machinery for the grammatical analysis of natural languages. Pregroup grammar used to analyse sentence structure in many European languages such as English, and non-European languages such as Japanese. In Arabic language, Lambek employed the notions of pregroup to analyse some grammatical structures such as conjugating the verb, tense modifiers and equational sentences. This work attempts to develop an initial phase of an efficient automatic pregroup grammar parser by using linear approach to analysethe verbal phrases of Modern Standard Arabic (MSA). The proposed system starts building Arabic lexicon contains all possible categories of Arabic verbs, then analysing the input verbal Arabic phrase to check if it is wellformed by using linear parsing algorithm based on pregroup grammar rules.
RuleML2015 The Herbrand Manifesto - Thinking Inside the Box RuleML
The traditional semantics for First Order Logic (sometimes called Tarskian semantics) is based on the notion of interpretations of constants. Herbrand semantics is an alternative semantics based directly on truth assignments for ground sentences rather than interpretations of constants. Herbrand semantics is simpler and more intuitive than Tarskian semantics; and, consequently, it is easier to teach and learn. Moreover, it is more expressive. For example, while it is not possible to finitely axiomatize integer arithmetic with Tarskian semantics, this can be done easily with Herbrand Semantics. The downside is a loss of some common logical properties, such as compactness and completeness. However, there is no loss of inferential power. Anything that can be proved according to Tarskian semantics can also be proved according to Herbrand semantics. In this presentation, we define Herbrand semantics; we look at the implications for research on logic and rules systems and automated reasoning; and and we assess the potential for popularizing logic.
Lecture slides by Mustafa Jarrar at Birzeit University, Palestine.
See the course webpage at: http://jarrar-courses.blogspot.com/2011/11/artificial-intelligence-fall-2011.html and http://www.jarrar.info
and on Youtube:
http://www.youtube.com/watch?v=v92oPUYxCQQ&list=PLCC05105BA39E9BC0
Slides for a Course Based on the Text Discrete Mathematics & Its Applications (5th Edition) by Kenneth H. Rosen
Slides for a Course Based on the Text Discrete Mathematics & Its Applications (5th Edition) by Kenneth H. Rosen
Lecture slides by Mustafa Jarrar at Birzeit University, Palestine.
See the course webpage at: http://jarrar-courses.blogspot.com/2011/12/description-logic.html
The lecture covers: Description Logic & Business Rules, In Artificial Intelligence Course, Birzeit University, Spring 2013
This talk is about Categorical Logic, a branch of Category Theory, a newer subfield of Algebra, established in the late forties/early fifties by Eilenberg and MacLane. One of its most exciting applications is to theoretical computer science and I plan to discuss it, from a very personal perspective.
Lecture slides by Mustafa Jarrar at Birzeit University, Palestine.
See the course webpage at: http://jarrar-courses.blogspot.com/2011/11/artificial-intelligence-fall-2011.html and http://www.jarrar.info
and on Youtube:
http://www.youtube.com/watch?v=v92oPUYxCQQ&list=PLCC05105BA39E9BC0
Slides for a Course Based on the Text Discrete Mathematics & Its Applications (5th Edition) by Kenneth H. Rosen
Slides for a Course Based on the Text Discrete Mathematics & Its Applications (5th Edition) by Kenneth H. Rosen
Lecture slides by Mustafa Jarrar at Birzeit University, Palestine.
See the course webpage at: http://jarrar-courses.blogspot.com/2011/12/description-logic.html
The lecture covers: Description Logic & Business Rules, In Artificial Intelligence Course, Birzeit University, Spring 2013
This talk is about Categorical Logic, a branch of Category Theory, a newer subfield of Algebra, established in the late forties/early fifties by Eilenberg and MacLane. One of its most exciting applications is to theoretical computer science and I plan to discuss it, from a very personal perspective.
Smart Cities, Smart Citizens and Smart DecisionsMartha Russell
Presentation given on December 11, 2016 in Hong Kong, hosted by Savantas Policy Institute, The Hong Kong Computer Society, Hong Kong Industry-University-Research Collaboration Association, Invotech, Internet Professional Association (iProA), and Savantas Liberal Arts Academy.
We stand on the thresh hold of abundance. Higher productivity is possible. Better quality of life is possible. We have new opportunities in personal and family wellness. The technological advances in sensors, connectivity and data now provide a perfect storm of change – for smart cities, smart workplaces, smart education, and smart communities. In this perfect storm, relationships, trust and vision are essential for innovation leadership. Shared vision among smart citizens allows people operating independently to arrive together at the same future. Massive data permits continuous feedback for high quality decisions. Change is an imperative. Change is continual. In order to move forward, we must be both the architects and the engines of change.
The question before us is: Are we moving forward – and, are we doing so fast enough?
Abstract Symbolic Automata: Mixed syntactic/semantic similarity analysis of e...FACE
We introduce a model for mixed syntactic/semantic approximation of programs based on symbolic finite automata (SFA). The edges of SFA are labeled by predicates whose semantics specifies the de- notations that are allowed by the edge. We introduce the notion of abstract symbolic finite automaton (ASFA) where approximation is made by abstract interpretation of symbolic finite automata, act- ing both at syntactic (predicate) and semantic (denotation) level. We investigate in the details how the syntactic and semantic abstractions of SFA relate to each other and contribute to the determination of the recognized language. Then we introduce a family of transformations for simplifying ASFA. We apply this model to prove properties of commonly used tools for similarity analysis of binary executables. Following the structure of their control flow graphs, disassembled binary executables are represented as (con- crete) SFA, where states are program points and predicates repre- sent the (possibly infinite) I/O semantics of each basic block in a constraint form. Known tools for binary code analysis are viewed as specific choices of symbolic and semantic abstractions in our framework, making symbolic finite automata and their abstract interpretations a unifying model for comparing and reasoning about soundness and completeness of analyses of low-level code.
The CLUES database: automated search for linguistic cognatesMark Planigale
Overview of the design of the CLUES database, developed as an aid to the comparative method in historical linguistics. Includes information on the design of the database and the strategies used to detect correlate forms (potential cognates), including metrics used to rate similarity of form and meaning.
The following study presents a collocation extraction approach based on clustering technique. This study uses a combination of several classical measures which cover all aspects of a given corpus then it suggests dividing bigrams found in a corpus in several disjoint groups according to the probability of presence of collocations. This will allow excluding groups where the presence of collocations is very unlikely and thus reducing in a meaningful way the search space.
Natural Language Generation from First-Order ExpressionsThomas Mathew
In this paper I discuss an approach for generating natural language from a first-order logic representation. The approach shows that a grammar definition for the natural language and a
lambda calculus based semantic rule collection can be applied for bi-directional translation using an overgenerate-and-prune mechanism.
The LSA breaks downanalyzes what constitutes a good and bad a.docxarnoldmeredith47041
The LSA breaks down/analyzes what constitutes a good and bad abstract.
http://www.linguisticsociety.org/resource/model-abstracts
Matthew Adams. Poetic correspondence in Welsh
Whether poetic forms are constrained by the same principles as prose and speech is a long-standing question in metrics. I present evidence from Welsh poetry that bears directly on this question, and argue that Long-Distance Consonantal Agreement (LDCA) is instantiated by the alliterative cynghanedd verse form. LDCA is a non-local phonological process visible in many languages in the form of consonantal harmony (Rose & Walker 2004, Hansson 2001, 2004) or vowel harmony (Rhodes 2009). I demonstrate that Agreement by Correspondence (ABC, Rose & Walker 2004), a formalization of LDCA, can be extended to analyze Welsh cynghanedd meter. ABC introduces output-output and input- output identity constraints that enforce long-distance similarity between segments sharing a specified subset of phonological features.
In the first two sentences of the introduction, the author introduces the theoretical context of the discussion and the language-specific phenomenon that will address an aspect of the relationship between prose and speech. The rest of the paragraph is devoted to spelling out in more detail the method by which the author will examine the relationship, primarily by providing citations of work within the broader theoretical context. The last sentence clearly states why the chosen framework, Agreement by Correspondence, is relevant to alliterative poetry: because it has been used to analyze cases of long-distance agreement in spoken language production, it also has value in providing an analysis for constrained, conventionalized language use. In sum, the paragraph makes clear the theoretical issue at hand, the literature that bears on this, and the way the author proposes to approach the issue.
The following example illustrates salient characteristics of this verse form:
Ifor, aur o | faerwriaethIfor, a fair golden stewardship
Deg, yw’rfau, | diegr o faethis mine, sweet nurture
(Lake et al. 2007)
For expository clarity, a bar (|) marks the division into half-lines. Within each line, the bolded consonants to the left of the bar correspond absolutely with the bolded consonants to the right of the bar; their linear order and segmental identity are preserved. Any consonants following the last vowel of each half-line (au and ae, in the second line) are not repeated. Thus, the final italicized ‘th’ sequence has no correspondent in the left-hand side of its line. Line division is determined by a pitch-accent prominence that falls on the ultima of some non-final word (indicated by underlining). Cynghanedd does not require that consonants in the left half occupy the same syllabic position as their counterparts in the right half (viz., the ‘r’ segments in the first line are first codas, then onsets).
This paragraph clearly but succinctly demonstrates how the alliterative form works .
Elevating Tactical DDD Patterns Through Object CalisthenicsDorra BARTAGUIZ
After immersing yourself in the blue book and its red counterpart, attending DDD-focused conferences, and applying tactical patterns, you're left with a crucial question: How do I ensure my design is effective? Tactical patterns within Domain-Driven Design (DDD) serve as guiding principles for creating clear and manageable domain models. However, achieving success with these patterns requires additional guidance. Interestingly, we've observed that a set of constraints initially designed for training purposes remarkably aligns with effective pattern implementation, offering a more ‘mechanical’ approach. Let's explore together how Object Calisthenics can elevate the design of your tactical DDD patterns, offering concrete help for those venturing into DDD for the first time!
Securing your Kubernetes cluster_ a step-by-step guide to success !KatiaHIMEUR1
Today, after several years of existence, an extremely active community and an ultra-dynamic ecosystem, Kubernetes has established itself as the de facto standard in container orchestration. Thanks to a wide range of managed services, it has never been so easy to set up a ready-to-use Kubernetes cluster.
However, this ease of use means that the subject of security in Kubernetes is often left for later, or even neglected. This exposes companies to significant risks.
In this talk, I'll show you step-by-step how to secure your Kubernetes cluster for greater peace of mind and reliability.
Le nuove frontiere dell'AI nell'RPA con UiPath Autopilot™UiPathCommunity
In questo evento online gratuito, organizzato dalla Community Italiana di UiPath, potrai esplorare le nuove funzionalità di Autopilot, il tool che integra l'Intelligenza Artificiale nei processi di sviluppo e utilizzo delle Automazioni.
📕 Vedremo insieme alcuni esempi dell'utilizzo di Autopilot in diversi tool della Suite UiPath:
Autopilot per Studio Web
Autopilot per Studio
Autopilot per Apps
Clipboard AI
GenAI applicata alla Document Understanding
👨🏫👨💻 Speakers:
Stefano Negro, UiPath MVPx3, RPA Tech Lead @ BSP Consultant
Flavio Martinelli, UiPath MVP 2023, Technical Account Manager @UiPath
Andrei Tasca, RPA Solutions Team Lead @NTT Data
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
Generative AI Deep Dive: Advancing from Proof of Concept to ProductionAggregage
Join Maher Hanafi, VP of Engineering at Betterworks, in this new session where he'll share a practical framework to transform Gen AI prototypes into impactful products! He'll delve into the complexities of data collection and management, model selection and optimization, and ensuring security, scalability, and responsible use.
Transcript: Selling digital books in 2024: Insights from industry leaders - T...BookNet Canada
The publishing industry has been selling digital audiobooks and ebooks for over a decade and has found its groove. What’s changed? What has stayed the same? Where do we go from here? Join a group of leading sales peers from across the industry for a conversation about the lessons learned since the popularization of digital books, best practices, digital book supply chain management, and more.
Link to video recording: https://bnctechforum.ca/sessions/selling-digital-books-in-2024-insights-from-industry-leaders/
Presented by BookNet Canada on May 28, 2024, with support from the Department of Canadian Heritage.
UiPath Test Automation using UiPath Test Suite series, part 4DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 4. In this session, we will cover Test Manager overview along with SAP heatmap.
The UiPath Test Manager overview with SAP heatmap webinar offers a concise yet comprehensive exploration of the role of a Test Manager within SAP environments, coupled with the utilization of heatmaps for effective testing strategies.
Participants will gain insights into the responsibilities, challenges, and best practices associated with test management in SAP projects. Additionally, the webinar delves into the significance of heatmaps as a visual aid for identifying testing priorities, areas of risk, and resource allocation within SAP landscapes. Through this session, attendees can expect to enhance their understanding of test management principles while learning practical approaches to optimize testing processes in SAP environments using heatmap visualization techniques
What will you get from this session?
1. Insights into SAP testing best practices
2. Heatmap utilization for testing
3. Optimization of testing processes
4. Demo
Topics covered:
Execution from the test manager
Orchestrator execution result
Defect reporting
SAP heatmap example with demo
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
zkStudyClub - Reef: Fast Succinct Non-Interactive Zero-Knowledge Regex ProofsAlex Pruden
This paper presents Reef, a system for generating publicly verifiable succinct non-interactive zero-knowledge proofs that a committed document matches or does not match a regular expression. We describe applications such as proving the strength of passwords, the provenance of email despite redactions, the validity of oblivious DNS queries, and the existence of mutations in DNA. Reef supports the Perl Compatible Regular Expression syntax, including wildcards, alternation, ranges, capture groups, Kleene star, negations, and lookarounds. Reef introduces a new type of automata, Skipping Alternating Finite Automata (SAFA), that skips irrelevant parts of a document when producing proofs without undermining soundness, and instantiates SAFA with a lookup argument. Our experimental evaluation confirms that Reef can generate proofs for documents with 32M characters; the proofs are small and cheap to verify (under a second).
Paper: https://eprint.iacr.org/2023/1886
Climate Impact of Software Testing at Nordic Testing DaysKari Kakkonen
My slides at Nordic Testing Days 6.6.2024
Climate impact / sustainability of software testing discussed on the talk. ICT and testing must carry their part of global responsibility to help with the climat warming. We can minimize the carbon footprint but we can also have a carbon handprint, a positive impact on the climate. Quality characteristics can be added with sustainability, and then measured continuously. Test environments can be used less, and in smaller scale and on demand. Test techniques can be used in optimizing or minimizing number of tests. Test automation can be used to speed up testing.
In his public lecture, Christian Timmerer provides insights into the fascinating history of video streaming, starting from its humble beginnings before YouTube to the groundbreaking technologies that now dominate platforms like Netflix and ORF ON. Timmerer also presents provocative contributions of his own that have significantly influenced the industry. He concludes by looking at future challenges and invites the audience to join in a discussion.
Essentials of Automations: The Art of Triggers and Actions in FMESafe Software
In this second installment of our Essentials of Automations webinar series, we’ll explore the landscape of triggers and actions, guiding you through the nuances of authoring and adapting workspaces for seamless automations. Gain an understanding of the full spectrum of triggers and actions available in FME, empowering you to enhance your workspaces for efficient automation.
We’ll kick things off by showcasing the most commonly used event-based triggers, introducing you to various automation workflows like manual triggers, schedules, directory watchers, and more. Plus, see how these elements play out in real scenarios.
Whether you’re tweaking your current setup or building from the ground up, this session will arm you with the tools and insights needed to transform your FME usage into a powerhouse of productivity. Join us to discover effective strategies that simplify complex processes, enhancing your productivity and transforming your data management practices with FME. Let’s turn complexity into clarity and make your workspaces work wonders!
Removing Uninteresting Bytes in Software FuzzingAftab Hussain
Imagine a world where software fuzzing, the process of mutating bytes in test seeds to uncover hidden and erroneous program behaviors, becomes faster and more effective. A lot depends on the initial seeds, which can significantly dictate the trajectory of a fuzzing campaign, particularly in terms of how long it takes to uncover interesting behaviour in your code. We introduce DIAR, a technique designed to speedup fuzzing campaigns by pinpointing and eliminating those uninteresting bytes in the seeds. Picture this: instead of wasting valuable resources on meaningless mutations in large, bloated seeds, DIAR removes the unnecessary bytes, streamlining the entire process.
In this work, we equipped AFL, a popular fuzzer, with DIAR and examined two critical Linux libraries -- Libxml's xmllint, a tool for parsing xml documents, and Binutil's readelf, an essential debugging and security analysis command-line tool used to display detailed information about ELF (Executable and Linkable Format). Our preliminary results show that AFL+DIAR does not only discover new paths more quickly but also achieves higher coverage overall. This work thus showcases how starting with lean and optimized seeds can lead to faster, more comprehensive fuzzing campaigns -- and DIAR helps you find such seeds.
- These are slides of the talk given at IEEE International Conference on Software Testing Verification and Validation Workshop, ICSTW 2022.
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...UiPathCommunity
💥 Speed, accuracy, and scaling – discover the superpowers of GenAI in action with UiPath Document Understanding and Communications Mining™:
See how to accelerate model training and optimize model performance with active learning
Learn about the latest enhancements to out-of-the-box document processing – with little to no training required
Get an exclusive demo of the new family of UiPath LLMs – GenAI models specialized for processing different types of documents and messages
This is a hands-on session specifically designed for automation developers and AI enthusiasts seeking to enhance their knowledge in leveraging the latest intelligent document processing capabilities offered by UiPath.
Speakers:
👨🏫 Andras Palfi, Senior Product Manager, UiPath
👩🏫 Lenka Dulovicova, Product Program Manager, UiPath
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
1. Glue Semantics for Proof Theorists
Valeria de Paiva
Nuance Communications, CA, USA
Abstract Proof Theory – April, 2013
2. Introduction
Glue Semantics
Glue in Action
Introduction
This talk is about the application of proof theoretic methods
to the semantics of natural languages like English.
Proof Theory had its beginnings as the poor cousin of Model
Theory in Mathematical Logic.
But it got a big boost from its use in Computer Science.
Proof theory has applications in the design and specification
of programming languages (type theories, compilers), in the
foundations of security and as well as being essential to
Artificial Intelligence and Automated Deduction.
Proof Theory also has extensive applications in Computational
Semantics of natural language. Here we concentrate on one
application to the syntax-semantics interface: Glue
Semantics
2 / 23
3. Introduction
Glue Semantics
Glue in Action
Glue semantics?
Glue semantics is a theory of the syntax-semantics interface of
natural language that uses linear logic for meaning composition.
Distinguish two separate logics in semantic interpretation
1. Meaning logic: target logical representation
2. Glue logic: logical specification of how chunks of meaning are
assembled
In principle, Glue uses any of several alternative grammar
formalisms and any of the mainstream semantics.
In practice, Glue started for LFG, with a vanilla Montague-style
logic for meanings.
Glue analyses have been proposed within HPSG, Context-free
grammar, Categorial grammar, and TAG.
Meaning languages in glue analyses include Discourse
Representation Theory, First-order logic, and Natural Semantic
Metalanguage(NSM). 3 / 23
4. Introduction
Glue Semantics
Glue in Action
Linear Implication and (Multiplicative) Conjunction
To assemble meanings we use (intuitionistic) multiplicative Linear
Logic.
Traditional implication: A, A → B B
A, A → B A∧B Re-use A
Linear implication: A, A −◦ B B
A, A −◦ B A⊗B Cannot re-use A
Traditional conjunction: A ∧ B A Discard B
Linear conjunction: A⊗B A Cannot discard B
4 / 23
5. Introduction
Glue Semantics
Glue in Action
The Linguistic Appeals of Linear Logic
Resource usage: appealing idea for thinking about linguistic issues.
1. How a string of words provides a sequence of resources that
can be consumed to construct a syntactic analysis of a sentence.
Lambek Calculus++
2. How word meanings provide a collection of resources that
can be used to construct the meaning of a sentence. (example)
3. How linguistic context can make certain resources available,
such as possible pronoun antecedents, that can be used to flesh
out the interpretations of he, she or it.
Only dealing with 2 above.
To begin with it looks like the proof semantics we’re used to.
5 / 23
7. Introduction
Glue Semantics
Glue in Action
Linguistic applications of linear logic
Categorial and type-logical grammar (Moortgat,
vanBenthem): including parsing categorial grammars (Morrill,
Hepple) and compositional semantics of categorial grammars
(Morrill, Carpenter)
Resource-based reformulations of other grammatical theories
Minimalism (Retore,Stabler)
Lexical Functional Grammar (Saraswat,Muskens)
Tree Adjoining Grammar (Abrusci)
AI issues such as the frame problem (White) or planning
(Dixon) with linguistic relevance
‘Glue semantics’ (a version of categorial semantics without an
associated categorial grammar?) (Dalrymple, Lamping &
Gupta))
7 / 23
8. Introduction
Glue Semantics
Glue in Action
Identity Criteria for Proofs
Two proofs of A, A → B B:
[A]1 A→B
→E
A→B A B
→E →, 1
B A→B A
→E
B
These are not really distinct proofs:
8 / 23
9. Introduction
Glue Semantics
Glue in Action
Lambda-Equivalence of Proof Terms
Include proof terms in previous derivations:
[x : A]1 f :A→B
→E
f :A→B a:A f (x ) : B
→E → I, 1
f (a) : B λx .f (x ) : A → B a:A
(λx .f (x ))(a) : B
Note: f (a) = (λx .f (x ))(a)
λ-equivalence of proof terms: semantic identity of derivations.
9 / 23
10. Introduction
Glue Semantics
Glue in Action
Curry-Howard Isomorphism (CHI)
CHI = Pairing of proof rules with operations on proof terms
But doesn’t work for all logics, or proof systems
Defines interesting identity criteria for proofs
Syntactically distinct derivations corresponding to same proof
Intimate relation between logic and type-theory.
Varied applications, e.g.
— Proofs as programs
— Semantic construction for natural language
10 / 23
11. Introduction
Glue Semantics
Glue in Action
Example: Using LFG Grammar
11 / 23
12. Introduction
Glue Semantics
Glue in Action
Cutting and Pasting 1...
12 / 23
13. Introduction
Glue Semantics
Glue in Action
Example: Input to Semantic Interpretation
Lexicon
Word Meaning Glue
John john ↑ where ↑= g
Fred fred ↑ where ↑= h
saw λy .λx . see(x , y ) ↑ .OBJ −◦ (↑ .SUBJ −◦ ↑)
where ↑= f , f .OBJ = h, f .SUBJ = g
Constituents g, h, f : semantic resources, consuming & producing
meanings
13 / 23
14. Introduction
Glue Semantics
Glue in Action
Lexical Premises: Their nature
saw
λy .λx . see(x , y ) : h −◦ (g −◦ f )
Meaning Term Glue Formula
(Propositional LL)
Atomic propositions (f , g, h):
• Correspond to syntactic constituents found in parsing
• Denote resources used in semantic interpretation
(Match production & consumption of constituent meanings)
Meaning terms:
• Expressions in some chosen meaning language
• Language must support abstraction and application
• . . . but otherwise relatively free choice
14 / 23
15. Introduction
Glue Semantics
Glue in Action
The Form of Glue Derivations
Γ M:f
where
• Γ is set of lexical premises (instantiated by parse)
• f is (LL atom corresponding to) sentential constituent
• M is meaning term produced by derivation
(Semantic) Ambiguity
Often (many) alternative derivations Γ Mi : f
each producing a different meaning term Mi for f
Need to find all alternative derivations (efficiently!)
15 / 23
16. Introduction
Glue Semantics
Glue in Action
Alternative Derivations: Modifier Scope
Consider phrase “alleged criminal from London”
λx . criminal(x ) : f
λP. alleged(P) : f −◦ f
λPλx . from(lon, x ) ∧ P(x ) : f −◦ f
There are two normal derivations, resulting in:
1. λx . from(lon, x ) ∧ alleged(criminal)(x ) : f
2. alleged(λx . from(lon, x ) ∧ criminal(x )) : f
16 / 23
17. Introduction
Glue Semantics
Glue in Action
Two normal derivations
17 / 23
18. Introduction
Glue Semantics
Glue in Action
Skeleton-Modifier Derivations
Modifier: any formula equivalent to φ −◦ φ
Initial derivation separating modifiers from skeleton
g g −◦ h −◦ f
h h −◦ f skeleton
f
g −◦ h −◦ f
a −◦ (f −◦ f )
⇒ a a −◦ (f −◦ f )
b −◦ (h −◦ f ) −◦ (h −◦ f ) modifier
g, h, a, b f −◦ f
b b −◦ ((h −◦ f ) −◦ (h −◦ f ))
modifier
(h −◦ f ) −◦ (h −◦ f )
Final derivation inserts modifiers
— All scope ambiguities due to modifier insertion
18 / 23
19. Introduction
Glue Semantics
Glue in Action
Quantifier Scope: Everyone saw something
everyone: (g −◦ f ) −◦ f
Premises saw: h −◦ (g −◦ f )
something: (h −◦ f ) −◦ f
Derivations:
∃∀ ∀∃
h −◦ (g −◦ f ) [h]
h −◦ (g −◦ f ) [h] g −◦ f [g]
g −◦ f (g −◦ f ) −◦ f f
f h −◦ f (h −◦ f ) −◦ f
h −◦ f (h −◦ f ) −◦ f f
f g −◦ f (g −◦ f ) −◦ f
f
19 / 23
20. Introduction
Glue Semantics
Glue in Action
With Meaning Terms
saw : h −◦ (g −◦ f ) [y : h]
saw (y ) : g −◦ f [x : g]
saw (y )(x ) : f
λy .saw (y )(x ) : h −◦ f everyone : (h −◦ f ) −◦ f
everyone(λy .saw (y )(x )) : f
λx .everyone(λy .saw (y )(x )) : g −◦ f something : (g −◦
something(λx .everyone(λy .saw (y )(x ))) : f
20 / 23
21. Introduction
Glue Semantics
Glue in Action
Glue Sales Pitch
Linguistically powerful & flexible approach
Interesting analyses of scope, control (Asudeh), event-based
semantics (Fry), intensional verbs (Dalrymple), context
dependence, coordination.
But many other phenomena still to do
Grammar & semantics engineering
Applicable to grammars besides LFG based ones
Steep learning curve for writing lexical entries
But turns out to allow plentiful re-use of “lingware”
Can be implemented efficiently: Lev, also in NLTK open
source github
21 / 23
22. Introduction
Glue Semantics
Glue in Action
Conclusions
For linguists: lots of language engineering to do, on a
principled basis.
For proof theorists: for this application cuts-with-axioms are
not a negligible cut, they are the most important cuts ever.
Counting how many there are and which derivations/proofs
they give rise to, is solving the ambiguity of language problem!
but you need a good grammar module..
also the application sits "in-between" the proof-search and the
proof-normalization paradigms...
22 / 23
23. Introduction
Glue Semantics
Glue in Action
References
PhD thesis of Asudeh and Lev (Stanford) and Kokkonidis
(Oxford)
Crouch and van Genabith (Linear Logic for Linguists)
Online Bibliography
http://users.ox.ac.uk/ lina1301/GlueBibliography.htm
plus Google code
http://nltk.googlecode.com/svn/trunk/doc/contrib/sem/gluesem.pd
https://github.com/nltk/nltk/blob/master/examples/grammars/
23 / 23