semantics

问题 I'm a little confused by the rel attribute usage. Individually I understand rel="author" , rel="me" and rel="publisher" , however I am wondering if I can mix and match attribute values. Example 1: On my website, I have a link in the footer which links to my domain. Do I add rel="me" , rel="author" or rel="me author" ? Example 2: On my website I have a link to my twitter account. Do I add rel="me" or rel="me publisher" ? 回答1: You can't add more than one rel attribute into one HTML element, but

问题 I'm a little confused by the rel attribute usage. Individually I understand rel="author" , rel="me" and rel="publisher" , however I am wondering if I can mix and match attribute values. Example 1: On my website, I have a link in the footer which links to my domain. Do I add rel="me" , rel="author" or rel="me author" ? Example 2: On my website I have a link to my twitter account. Do I add rel="me" or rel="me publisher" ? 回答1: You can't add more than one rel attribute into one HTML element, but

问题 Is there any tag that's suited to markup a path or directory? For example: <path>user/project/</path> I've checked all new HTML5 tags but there doesn't seem to be one that fits this purpose. So which one would come close? 回答1: Unfortunately there isn't anything in HTML for that. You could try to wrap it in a <pre> tag or <code> in HTML5. Otherwise you can use a <span> tag and style it how you want it to look like. 回答2: The code element represents a fragment of computer code. This could be an

问题 Reading "A re-introduction to JavaScript" I noticed something interesting about functions: The name provided to an anonymous function as above is(or at least should be) only available to the function's own scope. Entering some things based on the code in the tutorial at the nodejs prompt I was able to verify that node agrees with the author: function add(foo, bar) { return foo + bar; } add(1, 2); gets me 3, and: var five = (function plus(foo, bar) { return foo + bar; })(2, 3); plus(2, 3);

问题 Reading "A re-introduction to JavaScript" I noticed something interesting about functions: The name provided to an anonymous function as above is(or at least should be) only available to the function's own scope. Entering some things based on the code in the tutorial at the nodejs prompt I was able to verify that node agrees with the author: function add(foo, bar) { return foo + bar; } add(1, 2); gets me 3, and: var five = (function plus(foo, bar) { return foo + bar; })(2, 3); plus(2, 3);

问题 Reading "A re-introduction to JavaScript" I noticed something interesting about functions: The name provided to an anonymous function as above is(or at least should be) only available to the function's own scope. Entering some things based on the code in the tutorial at the nodejs prompt I was able to verify that node agrees with the author: function add(foo, bar) { return foo + bar; } add(1, 2); gets me 3, and: var five = (function plus(foo, bar) { return foo + bar; })(2, 3); plus(2, 3);

问题 Can someone help me understand the following definition from Wadler's paper titled "Comprehending Monads"? (Excerpt is from section 3.2/page 9, i.e., the "Strictness Monad" subsection.) Sometimes it is necessary to control order of evaluation in a lazy functional program. This is usually achieved with the computable function strict , defined by strict f x = if x ≠ ⊥ then f x else ⊥. Operationally, strict f x is reduced by first reducing x to weak head normal form (WHNF) and then reducing the

问题 I would like to use named entity recognition (NER) to find adequate tags for texts in a database. Instead of using tools like NLTK or Lingpipe I want to build my own tool. So my questions are: Which algorithm should I use? How hard is to build this tool? 回答1: I did this some time ago when I studied Markov chains. Anyway, the answers are: Which algorithm should I use? Stanford NLP for example uses Conditional Random Field (CRF). If you are not trying to do this effectively, you are like dude

问题 I would like to use named entity recognition (NER) to find adequate tags for texts in a database. Instead of using tools like NLTK or Lingpipe I want to build my own tool. So my questions are: Which algorithm should I use? How hard is to build this tool? 回答1: I did this some time ago when I studied Markov chains. Anyway, the answers are: Which algorithm should I use? Stanford NLP for example uses Conditional Random Field (CRF). If you are not trying to do this effectively, you are like dude

问题 I'm currently moving a page from HTML4 to HTML5, and I have kind of an issue. There's a bunch of lists with links inside the footer. Most of them link to information (faq etc.) about the site itself. So I think it's OK to put those inside a nav element (see "Introducing HTML5" and the HTHML5 Doctor). But two lists contain links to external pages like Facebook. Now I could wrap those inside an aside, but this is a bit of an edge case: "It is legitimate to wrap the links to other pages on the