Skip to main content

Ontologies for matching

I have previously wondered out loud what ontologies are good for. I now believe that one of the most powerful use cases for semantic technology lies in social networking applications; and matching in general.

By social networking I mean "putting people in touch with each other"; especially in situations that are inherently asymmetric. For example, putting potential volunteers in touch with people who could use their services; putting buyers in touch with sellers, and so on.

The reason is simple: the language spoken by the two sides is inherently different: a seller or volunteer knows a lot (or maybe not) about what he or she can do or would like to do. But a consumer often does not know to translate his or her problem into a solution that the provider can offer.

Put more graphically, providers speak features, and consumers speak problems. This is even if they can find each other.

In the middle, there is an opportunity for someone to put the two together. A match maker has to be able to put the right provider in touch with the right consumer; in a sense that is the measure of the quality of the match maker.

The more that a match maker knows about the domain, the range of things being offered and consumed, the easier it is for the match maker to do a good job.

Enter the Ontology: in a modern social networking application, the domain knowledge of the match maker can be encoded and used as the underlying basis for performing matches.

This is, in my view, a killer application for semantic web technology.

Popular posts from this blog

Comments Should be Meaningless

This is something of a counterintuitive idea: Comments should be meaningless What, I hear you ask, are you talking about? Comments should communicate to the reader! At least that is the received conventional wisdom handed does over the last few centuries (decades at least). Well, certainly, if you are programming in Assembler, or C, then yes, comments should convey meaning because the programming language cannot So, conversely, as a comment on the programming language itself, anytime the programmer feels the imperative to write a meaningful comment it is because the language is not able to convey the intent of the programmer. I have already noticed that I write far fewer comments in my Java programs than in my C programs.  That is because Java is able to capture more of my meaning and comments would be superfluous. So, if a language were able to capture all of my intentions, I would never need to write a comment. Hence the title of this blog.

Sub-turing complete programming languages

Here is an interesting intuition: the key to liberating software development is to use programming languages that are not, by themselves, turing-complete. That means no loops, no recursion 'in-language'. Why? Two reasons: any program that is subject to the halting problem is inherently unknowable: in general, the only way to know what a turing-complete program means is to run it. This puts very strong limitations on the combinatorics of turing-complete programs and also on the kinds of support tooling that can be provided: effectively, a debugger is about the best that you can do with any reasonable effort. On the other hand, a sub-turing language is also 'decidable'. That means it is possible to predict what it means; and paradoxically, a lot easier to provide a rich environment for it etc. etc. An interesting example of two languages on easier side of the turing fence are TeX and CSS. Both are designed for specifying the layout of text, TeX is turing complete and CSS

Existential Types are the flip side of generics

Generic types, as can now be seen in all the major programming languages have a flip side that has yet to be widely appreciated: existential types. Variables whose types are generic may not be modified within a generic function (or class): they can be kept in variables, they can be passed to other functions (provided they too have been supplied to the generic function), but other than that they are opaque. Again, when a generic function (or class) is used, then the actual type binding for the generic must be provided – although that type may also be generic, in which case the enclosing entity must also be generic. Existential types are often motivated by modules. A module can be seen to be equivalent to a record with its included functions: except that modules also typically encapsulate types too. Abstract data types are a closely related topic that also naturally connect to existential types (there is an old but still very relevant and readable article on the topic Abstract types have